-
1 automata equivalence
Большой англо-русский и русско-английский словарь > automata equivalence
-
2 automata equivalence
Математика: эквивалентность автоматов -
3 automata equivalence
English-Russian electronics dictionary > automata equivalence
-
4 automata equivalence
The New English-Russian Dictionary of Radio-electronics > automata equivalence
-
5 automata equivalence
English-Russian scientific dictionary > automata equivalence
-
6 automata
ɔ:ˈtɔmətə автоматы experiment with automata ≈ эксперимент с автоматами isomorphic automata automaton ≈ изоморфные автоматы related automata automaton ≈ связанные автоматы structural theor of automata ≈ структурная теория автоматов - automata equivalence - automata game - automata homomorphism - automata minimization - collective of automata - composition of automata - list of automata - product of automata - semigroup of automata - superposition of automata - synthesis of automata - theor of automatapl от automatonautomata pl от automatonБольшой англо-русский и русско-английский словарь > automata
-
7 equivalence
1) адекватность; эквивалентность3) равносильность; равноценность; равнозначность• -
8 equivalence
эквивалентность || эквивалентный- equivalence of categories
- absolute equivalence
- affine equivalence
- algebraic equivalence
- analytic equivalence
- analytical equivalence
- asymptotic equivalence
- asymptotical equivalence
- automata equivalence
- behavioral equivalence
- bilateral equivalence
- canonical equivalence
- cardinality equivalence
- chain equivalence
- complete equivalence
- conditioned equivalence
- conformal equivalence
- deductive equivalence
- empirical equivalence
- formal equivalence
- full equivalence
- fuzzy equivalence
- geometric equivalence
- logical equivalence
- observational equivalence
- one-to-one equivalence
- partial equivalence
- permutation equivalence
- projective equivalence
- quantitative equivalence
- recursive equivalence
- reversible equivalence
- semantic equivalence
- statistic equivalence
- strategic equivalence
- strict equivalence
- syntactic equivalence
- topologic equivalence
- topological equivalence -
9 equivalence
эквивалентность || эквивалентный- affine equivalence
- algebraic equivalence
- analytic equivalence
- analytical equivalence
- asymptotic equivalence
- asymptotical equivalence
- automata equivalence
- behavioral equivalence
- bilateral equivalence
- canonical equivalence
- cardinality equivalence
- chain equivalence
- complete equivalence
- conditioned equivalence
- conformal equivalence
- deductive equivalence
- empirical equivalence
- equivalence of algorithms
- equivalence of categories
- equivalency equivalence
- formal equivalence
- full equivalence
- fuzzy equivalence
- geometric equivalence
- logical equivalence
- observational equivalence
- one-to-one equivalence
- partial equivalence
- permutation equivalence
- projective equivalence
- quantitative equivalence
- recursive equivalence
- reversible equivalence
- semantic equivalence
- statistic equivalence
- strategic equivalence
- strict equivalence
- syntactic equivalence
- topologic equivalence
- topological equivalenceThe New English-Russian Dictionary of Radio-electronics > equivalence
-
10 эквивалентность автоматов
Большой англо-русский и русско-английский словарь > эквивалентность автоматов
См. также в других словарях:
Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
McNaughton's Theorem — In automata theory, McNaughton s theorem refers to a theorem that asserts that the set of ω regular languages is identical to the set of languages recognizable by deterministic Muller automata. [1] This theorem is proven by supplying an algorithm … Wikipedia
Complementation of Büchi automaton — In automata theory, complementation of a Büchi automaton is construction of another Büchi automaton that recognizes complement of the ω regular language recognized by the given Büchi automaton. Existence of algorithms for this construction proves … Wikipedia
Muller automaton — In automata theory, a Muller automaton is a type of an ω automaton. The acceptance condition separates a Muller automomaton from other ω automata. The Muller automata is defined using Muller acceptance condition, i.e. the set of all states… … Wikipedia
DFA minimization — In computer science, more specifically in the branch of automata theory, DFA minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has minimum number of states. Here, two DFAs are called … Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
Construction and Analysis of Distributed Processes — Developer(s) the INRIA VASY team Initial release 1986, 24–25 years ago Stable release … Wikipedia
A New Kind of Science — Author(s) Stephen Wolfram Country … Wikipedia
Tree automaton — A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The following article deals with branching tree automata, which correspond to regular languages of… … Wikipedia
John von Neumann — Von Neumann redirects here. For other uses, see Von Neumann (disambiguation). The native form of this personal name is Neumann János. This article uses the Western name order. John von Neumann … Wikipedia